Some large trivalent graphs having small diameters
نویسندگان
چکیده
منابع مشابه
Some Large Trivalent Graphs Having Small Diameters
Kantor, W.M., Some large trivalent graphs having small diameters, Discrete Applied Mathematics 37/38 (1992) 353-357. If Iz 2 10, then there is a tnvalent Cayley graph for G =PSL (n. y) whose diameter is O(logla). This paper concerns an improvement of a result of Babai, Kantor and Lubotzky [ 11. In that paper it was shown that there is a constant C such that every non-Abelian finite simple group...
متن کاملSuperconnected digraphs and graphs with small conditional diameters
The conditional diameter Dν of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the subdigraphs induced by V1 and V2, respectively, are at least ν. Thus, D0 is the standard diameter and D0 ≥ D1 ≥ . . . ≥ Dδ, where δ is the minimum degree. We prove that if Dν ≤ 2` − 3, where ` is a parameter related t...
متن کاملClassification of trivalent symmetric graphs of small order
CLASSIFICATION OF TRIVALENT SYMMETRIC GRAPHS OF SMALL ORDER Marston Conder and Margaret Morton Department of Mathematics University of Auckland Private Bag 92019 Auckland NEW ZEALAND A classification is given of all finite connected trivalent symmetric graphs on up to 240 vertices, based on an analysis of short relators in their automorphism groups. SUBJECT CLASSIFICATION 05C25(Primary) 20F05(S...
متن کاملNonexistence of certain cubic graphs with small diameters
Jorgensen, L.K., Nonexistence of certain cubic graphs with small diameters, Discrete Mathematics 114 (1993) 2655273. We consider the maximum number of vertices in a cubic graph with small diameter. We show that a cubic graph of diameter 4 has at most 40 vertices. (The Moore bound is 46 and graphs with 38 vertices are known.) We also consider bipartite cubic graphs of diameter 5, for which the M...
متن کاملDiameters of Cayley Graphs
We show that for integers k ≥ 2 and n ≥ 3, the diameter of the Cayley graph of SLn(Z/kZ) associated to a standard two-element generating set, is at most a constant times n 2 ln k. This answers a question of A. Lubotzky concerning SLn(Fp) and is unexpected because these Cayley graphs do not form an expander family. Our proof amounts to a quick algorithm for finding short words representing eleme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90145-z